Mutual information maximizing GAN inversion for real face with identity preservation

Recent generative adversarial networks (GANs) have yielded remarkable performance in face image synthesis. GAN inversion embeds an image into the latent space of a pretrained generator, enabling it to be used for real face manipulation. However, current inversion approaches for real faces suffer the dilemma of initialization collapse and identity loss. In this paper, we propose a hierarchical GAN inversion for real faces with identity preservation based on mutual information maximization. We first use a facial domain guaranteed initialization to avoid the initialization collapse. Furthermore, we prove that maximizing the mutual information between inverted faces and their identities is equivalent to minimizing the distance between identity features from inverted and original faces. Optimization for real face inversion with identity preservation is implemented on this mutual information-maximizing constraint. Extensive experimental results show that our approach outperforms state-of-the-art solutions for inverting and editing real faces, particularly in terms of face identity preservation.     

Influencer-defaulter mutation-based optimization algorithms for predicting electricity prices

Efficient electricity price forecasting plays a significant role in our society. In this paper, a novel influencer-defaulter mutation (IDM) mutation operator has been proposed. The IDM operator has been combined with six well-known optimization algorithms to create mutated optimization algorithms whose performance has been tested on twenty-four standard benchmark functions. Further, the artificial neural network is integrated with mutated optimization algorithms to solve the electricity price prediction problem. The policymakers can identify appropriate variables based on the predicted prices to help future market planning. The statistical results prove the efficacy of the IDM operator on the recent optimization algorithms.     

Importance of optical homogeneity for high-quality transparent ceramics

Two types of transparent Y₂O₃ ceramics without including large scattering sources such as residual pores, one with very high optical homogeneity (type A) and another one with slightly insufficient optical homogeneity (type B), are purposely prepared, and their optical properties are investigated and compared qualitatively and quantitatively. Type A ceramic exhibits transmittance characteristics with very low internal loss in the visible to infrared wavelength region, while type B ceramic is inferior in various optical performances especially in the short (visible) wavelength region. In type B ceramic, birefringence occurs due to optical inhomogeneity in the visible region, resulting in a decrease in the extinction ratio. Non-uniform refractive index distribution is also observed in the Schlieren image of type B ceramic, hence the laser beam quality through that material is degraded. This study proved the importance of optical homogeneity of transparent ceramics and clarified the problems in actual applications.     

Software Optimization in Ultrasound Imaging Technique Using Improved Deep Belief Learning Network on the Internet of Medical Things Platform

Wireless Personal Communications - The Internet of Medical Things (IoMT) is the array of medical instruments and related technologies that link Information Technology (IT) systems in...     

基于SSD的眨眼与打哈欠检测

提出了一种新的基于SSD网络的眨眼与打哈欠检测。首先,对原SSD架构进行四个方面的修改。第一,主干网用MobileNetV3替换了VGG,使得架构尺寸缩减三分之一。第二,重新设计了输出检测器,实现了目标检测与分类、目标定位与高宽比回归多任务的融合。第三,网络直接回归高宽比,比传统的从关键点离线计算高宽比的方法鲁棒性要高。第四,省去了非最大抑制层(NMS)中的重叠度(IOU)计算和阈值设定,使得单目标检测速度提高了40%。另外,在数据集YawDD上验证了所提出方法的有效性,眨眼与打哈欠的测全率为95.1%与100.0%,在单卡2080Ti上实现了41fps的高检测速度。     

Adaptive reversible data hiding for JPEG images with multiple two-dimensional histograms

Joint photographic experts group (JPEG) can provide good quality with small file size but also eliminate extensively the redundancies of images. Therefore, hiding data into JPEG images in terms of maintaining high visual quality at small file sizes has been a great challenge for researchers. In this paper, an adaptive reversible data hiding method for JPEG images containing multiple two-dimensional (2D) histograms is proposed. Adaptability is mainly reflected in three aspects. The first one is to preferentially select sharper histograms for data embedding after $K$ histograms are established by constructing the $k$th ($k\in \{1,2,\dots ,K\}$) histogram using the $k$th non-zero alternating current (AC) coefficient of all the quantized discrete cosine transform blocks. On the other hand, to fully exploit the strong correlation between coefficients of one histogram, the smoothness of each coefficient is estimated by a block smoothness estimator so that a sharply-distributed 2D-histogram is constructed by combining two coefficients with similar smoothness into a pair. The pair corresponding to low complexity is selected priorly for data embedding, leading to high embedding performance while maintaining low file size. Besides, we design multiple embedding strategies to adaptively select the embedding strategy for each 2D histogram. Experimental results demonstrate that the proposed method can achieve higher rate–distortion performance which maintaining lower file storage space, compared with previous studies.     

Imitative Collaboration: A mirror-neuron inspired mixed reality collaboration method with remote hands and local replicas

Mixed reality can overlay and display 3D digital content in the real world, convey abstract concepts to users, and promote the understanding of complex tasks. However, the abstract graphics overlaid on the physical space may cause a certain cognitive load for local users and reduce the efficiency of collaboration. To improve the efficiency of remote collaboration, we conducted an elicitation study on assembly tasks, explored the user needs for collaboration, and defined the design goals of our remote collaboration method. Inspired by the mirror-neuron mechanism, we present an imitative collaboration method that allows local users to imitate the interaction behavior of remote users to complete tasks. We also propose a series of interaction methods for remote users to select, copy, and interact with the local point clouds to facilitate the expression of collaboration intentions. Finally, the results of a user study evaluating our imitative collaboration method on assembly tasks are reported, confirming that our method improves collaboration efficiency while reducing the cognitive load of local users.     

Effect of relaxation time on the squeezed correlations of bosons for evolving sources in relativistic heavy-ion collisions

The squeezed back-to-back correlation（SBBC）of a boson–antiboson pair is sensitive to the time distribution of the particle-emitting source, and the SBBC function for an evolving source is expected to be affected by the relaxation time of the system. In this study, we investigated the effect of relaxation time on the SBBC function. We propose a method for calculating the SBBC function with relaxation-time approximation for evolving sources. SBBC functions of D⁰D^-0in relativi...     

Understand Students Feedback Using Bi-Integrated CRF Model Based Target Extraction

Educational institutions showing interest to find the opinion of the students about their course and the instructors to enhance the teaching-learning process. For this, most research uses sentiment analysis to track students’ behavior. Traditional sentence-level sentiment analysis focuses on the whole sentence sentiment. Previous studies show that the sentiments alone are not enough to observe the feeling of the students because different words express different sentiments in a sentence. There is a need to extract the targets in a given sentence which helps to find the sentiment towards those targets. Target extraction is the subtask of targeted sentiment analysis. In this paper, we proposed the innovative model to find the targets of the given sentence using Bi-Integrated Conditional Random Fields (CRF). A Parallel fusion neural network model is designed to perform this task. We evaluate the model using the Michigan dataset and we build a dataset for target extraction from student reviews. The experimental results show that our proposed fusion model achieves better results compared to baseline models.